The maximum likelihood threshold of a path diagram
نویسندگان
چکیده
منابع مشابه
The Maximum Likelihood Threshold of a Graph
The maximum likelihood threshold of a graph is the smallest number of data points that guarantees that maximum likelihood estimates exist almost surely in the Gaussian graphical model associated to the graph. We show that this graph parameter is connected to the theory of combinatorial rigidity. In particular, if the edge set of a graph G is an independent set in the n−1-dimensional generic rig...
متن کاملMaximum Likelihood Estimation of a Generalized Threshold Model
The open-loop Threshold Model, proposed by Tong [23], is a piecewise-linear stochastic regression model useful for modeling conditionally normal response time-series data. However, in many applications, the response variable is conditionally non-normal, e.g. Poisson or binomially distributed. We generalize the open-loop Threshold Model by introducing the Generalized Threshold Model (GTM). Speci...
متن کاملThreshold behaviour of the maximum likelihood method in population decoding.
We study the performance of the maximum likelihood (ML) method in population decoding as a function of the population size. Assuming uncorrelated noise in neural responses, the ML performance, quantified by the expected square difference between the estimated and the actual quantity, follows closely the optimal Cramer-Rao bound, provided that the population size is sufficiently large. However, ...
متن کاملOn maximum likelihood estimators for a threshold autoregression
For a stationary ergodic self-exciting threshold autoregressive model with single threshold parameter, Chan (1993) obtained the consistency and limiting distribution of the least-squares estimator for the underlying true parameters. In this paper, we derive the similar results for the maximum likelihood estimators of the same model under some regularity conditions on the error density, not nece...
متن کاملThe maximum-likelihood decoding threshold for graphic codes
For a class C of binary linear codes, we write θC : (0, 1) → [0, 12 ] for the maximum-likelihood decoding threshold function of C, the function whose value at R ∈ (0, 1) is the largest bit-error rate p that codes in C can tolerate with a negligible probability of maximum-likelihood decoding error across a binary symmetric channel. We show that, if C is the class of cycle codes of graphs, then θ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Statistics
سال: 2019
ISSN: 0090-5364
DOI: 10.1214/18-aos1724